A compositional coalgebraic model of fusion calculus
نویسندگان
چکیده
منابع مشابه
A compositional coalgebraic model of fusion calculus
This paper is a further step in exploring the labelled transitions and bisimulations offusion calculi. We follow a recent theory by the same authors and previously appliedto the pi-calculus for lifting calculi with structural axioms to bialgebras and, thus,we provide a compositional model of the fusion calculus with explicit fusions. Insuch a model, the bisimilarity relation ind...
متن کاملA Compositional Coalgebraic Model of a Fragment of Fusion Calculus
This work is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow the approach developed by Turi and Plotkin for lifting transition systems with a syntactic structure to bialgebras and, thus, we provide a compositional model of the fusion calculus with explicit fusions. In such a model, the bisimilarity relation induced by the unique morphism to th...
متن کاملA Compositional Coalgebraic Model of Monadic Fusion Calculus
We propose a compositional coalgebraic semantics of the Fusion calculus of Parrow and Victor in the version with explicit fusions by Gardner and Wischik. We follow a recent approach developed by the authors and previously applied to the pi-calculus for lifting calculi with structural axioms to bialgebraic models. In our model, the unique morphism to the final bialgebra induces a bisimilarity re...
متن کاملA Compositional Coalgebraic Semantics of Strategic Games
We provide a compositional coalgebraic semantics for strategic games. In our framework, like in the semantics of functional programming languages, coalgebras represent the observable behaviour of systems derived from the behaviour of the parts over an unobservable state space. We use coalgebras to describe and program stage games, finitely and potentially infinitely repeated hierarchical or par...
متن کاملA Coalgebraic Calculus for Component Based Systems
In this paper we describe the coalgebraic models for state-based software components and componentbased systems. The behaviour patterns of components are specified by strong monads. A family of operators for combining components based on the category of coalgebras are defined and a set of algebraic laws are also presented to specify the properties being satisfied by these operators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2007
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.05.001